On bar frameworks, stress matrices and semidefinite programming
نویسندگان
چکیده
منابع مشابه
On bar frameworks, stress matrices and semidefinite programming
A bar framework G(p) in r-dimensional Euclidean space is a graph G = (V,E) on the vertices 1, 2, . . . , n, where each vertex i is located at point p in R. Given a framework G(p) in R, a problem of great interest is that of determining whether or not there exists another framework G(q), not obtained from G(p) by a rigid motion, such that ||q−q || = ||p−p || for all (i, j) ∈ E. This problem is k...
متن کاملSemidefinite Programming in the Space of Partial Positive Semidefinite Matrices
We build upon the work of Fukuda et al. [SIAM J. Optim., 11 (2001), pp. 647–674] and Nakata et al. [Math. Program., 95 (2003), pp. 303–327], in which the theory of partial positive semidefinite matrices was applied to the semidefinite programming (SDP) problem as a technique for exploiting sparsity in the data. In contrast to their work, which improved an existing algorithm based on a standard ...
متن کاملEuclidean Distance Matrices, Semidefinite Programming, and Sensor Network Localization
The fundamental problem of distance geometry, F P DG , involves the characterization and study of sets of points based only on given values of (some of) the distances between pairs of points. This problem has a wide range of applications in various areas of mathematics, physics, chemistry, and engineering. Euclidean Distance Matrices, EDM , play an important role in F P DG . They use the square...
متن کاملSingular value inequalities for positive semidefinite matrices
In this note, we obtain some singular values inequalities for positive semidefinite matrices by using block matrix technique. Our results are similar to some inequalities shown by Bhatia and Kittaneh in [Linear Algebra Appl. 308 (2000) 203-211] and [Linear Algebra Appl. 428 (2008) 2177-2191].
متن کاملPSDBoost: Matrix-Generation Linear Programming for Positive Semidefinite Matrices Learning
In this work, we consider the problem of learning a positive semidefinite matrix. The critical issue is how to preserve positive semidefiniteness during the course of learning. Our algorithm is mainly inspired by LPBoost [1] and the general greedy convex optimization framework of Zhang [2]. We demonstrate the essence of the algorithm, termed PSDBoost (positive semidefinite Boosting), by focusin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2010
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-010-0389-z